Implicational classes of De Morgan lattices
نویسندگان
چکیده
منابع مشابه
Belnap's Four-Valued Logic and De Morgan Lattices
In my paper [3], recently published in this Journal, I study several aspects of the relations between Belnap's logic B and the class DM of De Morgan lattices. Some of these relations concern a Gentzen system for Belnap's logic, denoted by G B , which was introduced in 1988 by my colleague Ventura Verdú and me (see [5] and [6]); indeed, the study of this Gentzen system within the theory of full ...
متن کاملConsistency in Fuzzy Description Logics over Residuated De Morgan Lattices
Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic SHI with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of SHI...
متن کاملEquational and implicational classes of co-algebras
If F : Set → Set is a functor which is bounded and preserves weak generalized pullbacks then a class of F-coalgebras is a covariety, i.e., closed under H (homomorphic images), S (sub-coalgebras) and ∑ (sums), if and only if it can be de0ned by a set of “coequations”. Similarly, quasi-covarieties, i.e., classes closed under H and ∑ , can be characterized by implications of coequations. These res...
متن کاملDe Morgan Triples Revisited
In this paper we overview basic known results about the varieties generated by De Morgan triples and about the problem to find equations defining the variety generated by a concrete De Morgan triple. We also provide some alternative proofs and some new results, specially for the case of Łukasiewicz De Morgan triples.
متن کاملMinimum Implicational Basis for -Semidistributive Lattices
For a ∧-semidistributive lattice L, we study some particular implicational systems and show that the cardinality of a minimum implicational basis is polynomial in the size of join-irreducible elements of the lattice L. We also provide a polynomial time algorithm to compute a minimum implicational basis for L. © 2006 Published by Elsevier B.V.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00007-2